The Partition Technique for Overlays of Envelopes

نویسندگان

  • Vladlen Koltun
  • Micha Sharir
چکیده

We obtain a near-tight bound of O(n), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This settles a long-standing problem in the theory of arrangements, most recently cited by Agarwal and Sharir [3, Open Problem 2], and substantially improves and simplifies a result previously published by the authors [17]. Our bound is obtained by introducing a new approach to the analysis of combinatorial structures arising in geometric arrangements of surfaces. This approach, which we call the ‘partition technique’, is based on k-fold divide and conquer, in which a given collection F of n surfaces is partitioned into k subcollections Fi of n/k surfaces each, and the complexity of the relevant combinatorial structure in F is recursively related to the complexities of the corresponding structures in each of the Fi’s. We introduce this approach by applying it first to obtain a new simple proof for the known near-quadratic bound on the complexity of an overlay of two minimization diagrams of collections of surfaces in R, thereby simplifying the previously available proof [2]. The main new bound on overlays has numerous algorithmic and combinatorial applications, some of which are presented in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Green envelopes classification: the comparative analysis of efficient factors on the thermal and energy performance of green envelopes

This paper classifies green envelopes as green roofs and green walls according to effective factors, which were derived from literature to compare the green envelopes’ thermal and energy performance in a more effective way. For this purpose, an extensive literature review was carried out by searching keywords in databases and studying related journal papers and articles. The research meth...

متن کامل

An Investigation on In-situ Strength and Bonding Strength of Polymer Modified Concretes (PMC) as Repair Overlays on Conventional Concrete Substrate

Polymer modified concrete (PMC) consists of Portland cement concrete with a polymer modifier. Its advantages are proper bonding strength to substrate concrete, high tensile and flexural strength and low amount of shrinkage and permeability. Using PMC overlays can be considered as a method for preservation of damaged concrete structures due to their suitable performance and durability. In this r...

متن کامل

A Novel Efficient Method for Extraction and Purification of Recombinant Phenylalanine Dehydrogenase

Growing applications of phenylalanine dehydrogenase (PheDH) enzyme in the medical and pharmaceutical industries encourages researchers to seek simple, fast and economical alternative purification methods. With goal of finding a new technique, the extraction and purification of recombinant Bacillus badius PheDH in polyethylene glycol 6000 (PEG-6000) and ammonium sulfate aqueous two-phase systems...

متن کامل

Partition Tolerance and Data Consistency in Structured Overlay Networks

Structured overlay networks form amajor class of peer-to-peer systems, which are used to build scalable, fault-tolerant and selfmanagingdistributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. On the routing level, we provide algorithms for maintaining the structure of the overlay, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2002